Fast Exhaustive Robust Matching
نویسندگان
چکیده
This work presents a fast exhaustive robust matching technique for aligning translated images. The key idea is to express a robust matching surface function in terms of correlation operations. Speed is obtained from computing correlations in the frequency domain. Different sized images and arbitrary shapes may be matched. The method outputs a matching surface representing the quality of match at each translatory position. Experimental results of a comparison with the standard method of phase correlation are shown.
منابع مشابه
Orientation Correlation
A new method of translational image registration is presented: orientation correlation. The method is fast, exhaustive, statistically robust, and illumination invariant. No existing method has all of these properties. A modification that is particularly well suited to matching images of differing modalities, squared orientation correlation, is also given. Orientation correlation works by correl...
متن کاملFRoTeMa: Fast and Robust Template Matching
Template matching is one of the most basic techniques in computer vision, where the algorithm should search for a template image T in an image to analyze I. This paper considers the rotation, scale, brightness and contrast invariant grayscale template matching problem. The proposed algorithm uses a sufficient condition for distinguishing between candidate matching positions and other positions ...
متن کاملNew dictionary and fast atom searching method for matching pursuit representation of displaced frame difference
Matching Pursuit decomposes a signal into a linear expansion of functions selected from a redundant dictionary, isolating the signal structures that are coherent with respect to a given dictionary. In this paper we focus on the Matching Pursuit representation of the displaced frame difference (dfd). In particular, we introduce a new dictionary for Matching Pursuit that efficiently exploits the ...
متن کاملReal-Time Feature Descriptor Matching via a Multi-Resolution Exhaustive Search Method
Feature descriptor matching plays an important role in many computer vision applications. This paper presents a novel fast linear exhaustive search algorithm combined with a multi-resolution candidate elimination technique to deal with this problem efficiently. The proposed algorithm is inspired from the existing multiresolution image retrieval approaches, but releasing the requirement on a nor...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کامل